Retractions of finite distance functions onto tree metrics
نویسندگان
چکیده
منابع مشابه
Retractions of Finite Distance Functions Onto Tree Metrics
Trees with positively-weighted edges induce a natural metric on any subset of vertices, however not every metric is representable in this way. A problem arising in areas of classification, particularly in evolutionary biology, is how to approximate an arbitrary distance function by such a tree metric, and thereby estimate the underlying tree that generated the data. Such transformations, from d...
متن کاملRetractions onto series-parallel posets
The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet admits a retraction onto P, that is, whether there is a homomorphism from Q onto P which fixes every element of P. We study this problem for finite series-parallel posets P. We present equivalent combinatorial, algebraic, and topological charaterisations of posets for which the problem is tractable,...
متن کاملOn Continuous Choice of Retractions onto Nonconvex Subsets
For a Banach space B and for a class A of its bounded closed retracts, endowed with the Hausdorff metric, we prove that retractions on elements A ∈ A can be chosen to depend continuously on A, whenever nonconvexity of each A ∈ A is less than 1 2 . The key geometric argument is that the set of all uniform retractions onto an α−paraconvex set (in the spirit of E. Michael) is α 1−α −paraconvex sub...
متن کاملApproximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch
We study the problem of how well a tree metric is able to preserve the sum of pairwisedistances of an arbitrary metric. This problem is closely related to low-stretch metricembeddings and is interesting by its own flavor from the line of research proposed in theliterature.As the structure of a tree imposes great constraints on the pairwise distances, any embed-ding of a ...
متن کاملFinite Tree Automata with Cost Functions
Cost functions for tree automata are mappings from transitions to (tuples o0 polynomials over some semiring. We consider four semirings, namely N the semiring of nonnegative integers, A the "arctical semiring", T the tropical semiring and F the semiring of finite subsets of nonnegative integers. We show: for semirings N and A it is decidable in polynomial time whether or not the costs of accept...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00128-0